On partition functions related to Schur’s second partition theorem
نویسندگان
چکیده
منابع مشابه
A Combinatorial Proof of Andrews’ Partition Functions Related to Schur’s Partition Theorem
We construct an involution to show equality between partition functions related to Schur’s second partition theorem.
متن کاملOn Vector Partition Functions
Vector part i t ion functions appear in m a n y areas of mathemat ics and its applications, including representat ion theory [ 9 ] , commuta t ive algebra [ 14], approximat ion theory [ 4 ] and statistics [5 ] . It was shown by Blakley [ 2 ] that there exists a finite decomposi t ion of N d such that ~b A is a polynomial of degree n d on each piece. Here we describe such a decomposi t ion expli...
متن کاملA Partition Theorem
We prove a partition theorem (in the sense of the theorems of Ramsey [3], Erdös-Rado [1], and Rado [2]) which together with a forthcoming paper by Halpern and A. Levy will constitute a proof of the independence of the axiom of choice from the Boolean prime ideal theorem in Zermelo-Fraenkel set theory with the axiom of regularity. Although the theorem arises in logic, it is of a purely combinato...
متن کاملEuler's Partition Theorem
Euler’s Partition Theorem states that the number of partitions with only distinct parts is equal to the number of partitions with only odd parts. The combinatorial proof follows John Harrison’s pre-existing HOL Light formalization [1]. To understand the rough idea of the proof, I read the lecture notes of the MIT course 18.312 on Algebraic Combinatorics [2] by Gregg Musiker. This theorem is the...
متن کاملA Partition Theorem
We deal with some relatives of the Hales Jewett theorem with primitive recursive bounds.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1968
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1968-0225741-2